the trim loss concentration in one-dimensional cutting stock problem (1d-csp) by defining a virtual cost

نویسندگان

h javanshir

m shadalooee

چکیده

nowadays, one-dimensional cutting stock problem (1d-csp) is used in many industrial processes and re-cently has been considered as one of the most important research topic. in this paper, a metaheuristic algo-rithm based on the simulated annealing (sa) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. in this method, the 1d-csp is taken into account as item-oriented and the authors have tried to minimize the trim loss concentration by using the simulated an-nealing algorithm and also defining a virtual cost for the trim loss of each stock. the solved sample problems show the ability of this algorithm to solve the 1d-csp in many cases.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost

Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...

متن کامل

One-dimensional Cutting Stock Problem (1d-csp): a Study on Data Dependent Trim Loss

A generalized approach is introduced for getting minimal trim in onedimensional cutting stock problem (1D-CSP) which occurs extensively while manufacturing of different engineering objects. Our study is especially focused on transmission tower manufacturing industry. The concept of computing total trim by using the idea of pre-defined sustainable trim has been explored in previous work of autho...

متن کامل

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

متن کامل

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...

متن کامل

A Local Search Approach for One Dimensional Cutting Stock Problem

One dimensional cutting stock problem (1D-CSP) is one of the representative combinatorial optimization problems, which has many applications in, e.g., steel, paper and fiber industries. To define an instance of 1D-CSP, we are given sufficient number of stock rolls which have the same length L, and m types of products with given lengths (l1, l2, . . . , lm) and demands (d1, d2, . . . , dm). A cu...

متن کامل

Flexible Stock Allocation and Trim Loss Control for Cutting Problem in the Industrial - Use Paper Production

We consider a one-dimensional cutting stock problem (CSP) in which the stock widths are not used to fulfill the order but kept for use in the future for the industrial-use paper production. We present a new model based on the flexible stock allocation and trim loss control to determine the production quantity. We evaluate our approach using a real data and show that we are able to solve industr...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of industrial engineering, international

ISSN 1735-5702

دوره 3

شماره 4 2007

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023